Tractable Planning with State Variables by Exploiting Structural Restrictions
نویسندگان
چکیده
So far, tractable planning problems reported in the literature have been defined by syntactical restrictions. To better exploit the inherent structure in problems, however, it is probably necessary to study also structural restrictions on the state-transition graph. Such restrictions are typically computationally hard to test, though, since this graph is of exponential size. Hence, we take an intermediate approach, using a statevariable model for planning and restricting the state-transition graph implicitly by restricting the transition graph for each state variable in isolation. We identify three such restrictions which are tractable to test and we present a planning algorithm which is correct and runs in polynomial time under these restrictions.
منابع مشابه
Complexity Results for State-variable Planning under Mixed Syntactical and Structural Restrictions
Most tractable planning problems reported in the literature have been deened by syntactical restrictions. To better exploit the inherent structure of problems, however, it is probably necessary to study also structural restrictions on the state-transition graph. We present an exhaustive map of complexity results for state-variable planning under all combinations of our previously analysed synta...
متن کاملState-Variable Planning Under Structural Restrictions: Algorithms and Complexity
Computationally tractable planning problems reported in the literature so far have almost exclusively been de ned by syntactical restrictions. To better exploit the inherent structure in problems, it is probably necessary to study also structural restrictions on the underlying state-transition graph. The exponential size of this graph, though, makes such restrictions costly to test. Hence, we p...
متن کاملTractable Cost-Optimal Planning over Restricted Polytree Causal Graphs
Causal graphs are widely used to analyze the complexity of planning problems. Many tractable classes have been identified with their aid and state-of-the-art heuristics have been derived by exploiting such classes. In particular, Katz and Keyder have studied causal graphs that are hourglasses (which is a generalization of forks and inverted-forks) and shown that the corresponding cost-optimal p...
متن کاملNew Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimization is tractable, and identify certain conditions that differentiate between tractable and intractable problems. These results are based on exploiting both structural and syntactic characteristics of planning problems...
متن کاملAct Local, Think Global: Width Notions for Tractable Planning
Many of the benchmark domains in AI planning are tractable on an individual basis. In this paper, we seek a theoretical, domain-independent explanation for their tractability. We present a family of structural conditions that both imply tractability and capture some of the established benchmark domains. These structural conditions are, roughly speaking, based on measures of how many variables n...
متن کامل